Automatic Presentations for Cancellative Semigroups
نویسندگان
چکیده
This paper studies FA-presentable structures and gives a complete classification of the finitely generated FA-presentable cancellative semigroups. We show that a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group.
منابع مشابه
Automatic presentations for semigroups
This paper applies the concept of FA-presentable structures to semigroups. We give a complete classification of the finitely generated FA-presentable cancellative semigroups: namely, a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group. We prove that all finitely generated commutative semigroups are FA-presentable. We giv...
متن کاملCommutative cancellative semigroups of finite rank
The rank of a commutative cancellative semigroup S is the cardinality of a maximal independent subset of S. Commutative cancellative semigroups of finite rank are subarchimedean and thus admit a Tamura-like representation. We characterize these semigroups in several ways and provide structure theorems in terms of a construction akin to the one devised by T. Tamura for N-semigroups.
متن کامل-
In this paper we introduce R-right (left), L-left (right) cancellative and weakly R(L)-cancellative semigroups and will give some equivalent conditions for completely simple semigroups, (completely) regular right (left) cancellative semigroups, right (left) groups, rectangular groups, rectangular bands, groups and right (left) zero semigroups according to R-right (left), L-left (right) and weak...
متن کاملOn Fuzzy Congruences of a Type-B Semigroup I
The main aim of this paper is to study fuzzy congruences of typeB semigroups. After obtaining some properties and characterizations of fuzzy good congruences on adequate semigroups, we consider fuzzy good congruences on type-B semigroups. Finally, we prove a theorem giving equivalent conditions on fuzzy cancellative congruences of such semigroups. Mathematics Subject Classification: 06F05; 20M10
متن کاملCancellativity is undecidable for automatic semigroups
Via an encoding of the Modified Post’s Correspondence Problem, this paper shows that it is undecidable whether an automatic semigroup is cancellative.
متن کامل